Locality Preserving Projection for Domain Adaptation with Multi-Objective Learning
نویسندگان
چکیده
In many practical cases, we need to generalize a model trained in a source domain to a new target domain. However, the distribution of these two domains may differ very significantly, especially sometimes some crucial target features may not have support in the source domain. This paper proposes a novel locality preserving projection method for domain adaptation task, which can find a linear mapping preserving the ’intrinsic structure’ for both source and target domains. We first construct two graphs encoding the neighborhood information for source and target domains separately. We then find linear projection coefficients which have the property of locality preserving for each graph. Instead of combing the two objective terms under compatibility assumption and requiring the user to decide the importance of each objective function, we propose a multiobjective formulation for this problem and solve it simultaneously using Pareto optimization. The Pareto frontier captures all possible good linear projection coefficients that are preferred by one or more objectives. The effectiveness of our approach is justified by both theoretical analysis and empirical results on real world data sets. The new feature representation shows better prediction accuracy as our experiments demonstrate.
منابع مشابه
Graph and Subspace Learning for Domain Adaptation
Graph and Subspace Learning for Domain Adaptation by Le Shu Doctor of Philosophy in Computer and Information Sciences Temple University in Philadelphia, October, 2015 Researcher Advisor: Longin Jan Latecki In many practical problems, given that the instances in the training and test may be drawn from different distributions, traditional supervised learning can not achieve good performance on th...
متن کاملLocality Preserving Hashing
Hashing has recently attracted considerable attention for large scale similarity search. However, learning compact codes with good performance is still a challenge. In many cases, the real-world data lies on a low-dimensional manifold embedded in high-dimensional ambient space. To capture meaningful neighbors, a compact hashing representation should be able to uncover the intrinsic geometric st...
متن کاملGabor Feature Based Face Recognition Using Supervised Locality Preserving Projection
This paper introduces a novel Gabor-based supervised locality preserving projection (GSLPP) method for face recognition. Locality preserving projection (LPP) is a recently proposed method for unsupervised linear dimensionality reduction. LPP seeks to preserve the local structure which is usually more significant than the global structure preserved by principal component analysis (PCA) and linea...
متن کاملOptimizing Kernel Function with Applications to Kernel Principal Analysis and Locality Preserving Projection for Feature Extraction
Kernel learning is a popular research topic in pattern recognition and machine learning. Kernel selection is a crucial problem endured by kernel learning method in the practical applications. Many methods of finding the optimal parameters have been presented, but this kind of methods have no ability of changing the kernel structure, accordingly without changing the data distribution in kernel m...
متن کاملOptimized Discriminant Locality Preserving Projection of Gabor Feature for Biometric Recognition
Discriminant locality preserving projection(DLPP) can not obtain optimal discriminant vectors which utmostly optimize the objective of DLPP. This paper proposed a Gabor based optimized discriminant locality preserving projections (ODLPP) algorithm which can directly optimize discriminant locality preserving criterion on high-dimensional Gabor feature space via simultaneous diagonalization, with...
متن کامل